Stability and Sample-Based Approximations of Composite Stochastic Optimization Problems

نویسندگان

چکیده

Optimization under uncertainty and risk is ubiquitous in business, engineering, finance. Typically, we use observed or simulated data our decision models, which aim to control risk, result composite functionals. The paper addresses the stability of problems when functionals are subjected measure perturbations at multiple levels potentially different nature. We analyze data-driven formulations with empirical smoothing estimators such as kernels wavelets applied some all functions compositions establish laws large numbers consistency optimal values solutions. This first study propose optimization problems. It shown that kernel-based wavelet estimation provide less biased compared plug-in assumptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of stochastic optimization problems - nonmeasurable case

This paper deals with stability of stochastic optimization problems in a general setting. Objective function is defined on a metric space and depends on a probability measure which is unknown, but, estimated from empirical observations. We try to derive stability results without precise knowledge of problem structure and without measurability assumption. Moreover, ε-optimal solutions are consid...

متن کامل

Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems

We propose the use of sequences of separable, piecewise linear approximations for solving nondifferentiable stochastic optimization problems. The approximations are constructed adaptively using a combination of stochastic subgradient information and possibly sample information on the objective function itself. We prove the convergence of several versions of such methods when the objective funct...

متن کامل

Time-consistent approximations of risk-averse multistage stochastic optimization problems

OF THE DISSERTATION TIME-CONSISTENT APPROXIMATIONS OF RISK-AVERSE MULTISTAGE STOCHASTIC OPTIMIZATION PROBLEMS by Tsvetan Asamov Dissertation Director: Andrzej Ruszczyński In this work we study the concept of time consistency as it relates to multistage risk-averse stochastic optimization problems on finite scenario trees. We use dynamic time-consistent formulations to approximate problems havin...

متن کامل

Approximations of Stochastic Optimization Problems Subject to Measurability Constraints

Motivated by the numerical resolution of stochastic optimization problems subject to measurability constraints, we focus upon the issue of how to discretize the components arising in the problem formulation. By means of a counterexample based on Monte Carlo approximation, we emphasize the importance of independent discretization of, on the one side, the random variable modelling uncertainties (...

متن کامل

Sample Average Approximation Method for Compound Stochastic Optimization Problems

The paper studies stochastic optimization (programming) problems with compound functions containing expectations and extreme values of other random functions as arguments. Compound functions arise in various applications. A typical example is a variance function of nonlinear outcomes. Other examples include stochastic minimax problems, econometric models with latent variables, multi-level and m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2022

ISSN: ['1526-5463', '0030-364X']

DOI: https://doi.org/10.1287/opre.2022.2308